Final report for Ceniit project 01.06 (2001–2007) Optimization Algorithms for Integrated Code Generation
نویسنده
چکیده
In this project we developed integrative methods for generating high-quality code for embedded and instruction-level parallel processor architectures, including regular architectures such as superscalars and VLIW, as well as irregular architectures, such as clustered VLIW and DSP processors. Even though today’s DSP processors are more compiler friendly than a decade ago or than today’s network processors, they impose intricate structural constraints on the parallel use of functional units, the placement of operands in registers, and the scheduling of instructions. Additionally, these various constraints strongly depend on each other. As a consequence, traditional approaches to code generation that solve the problem by treating the subproblems in isolation in separate, subsequent phases, can either not be applied at all or produce code of very poor quality. On the other hand, DSP code must meet very high quality demands in terms of execution time, required memory space, code size, and energy consumption. Often, the application code is fixed, its time-critical part is comparably small in size, and aggressive overnight or parallel optimization is feasible. However, an integrated approach to optimal code generation that considers instruction selection, instruction scheduling and register allocation simultaneously constitutes a very hard combinatorial optimization problem. We developed and implemented exact algorithms, based on dynamic programming and on integer linear programming, that can solve the integrated problem for reasonable problem sizes and realistic architectures. For larger problem instances we provided heuristic algorithms. Beyond execution time, we also targeted alternative code optimization goals such as energy consumption. The algorithms are implemented in our retargetable code generation framework called OPTIMIST, where the target processor architecture is modeled in our architecture description language xADML.
منابع مشابه
Integrated Optimal Code Generation for Digital Signal Processors
In this thesis we address the problem of optimal code generation for irregular architectures such as Digital Signal Processors (DSPs). Code generation consists mainly of three interrelated optimization tasks: instruction selection (with resource allocation), instruction scheduling and register allocation. These tasks have been discovered to be NP-hard for most architectures and most situations....
متن کاملOptimal Operation of CHP Combined Heat Generation Systems Using the Crow Search Optimization Algorithm
Energy efficiency of power plants is less than 60% However, the efficiency of the CHP units can be up to 90 %.CHP units in addition to high efficiency, They reduce environmental pollutants by 13 to 18 percent. The purpose of this thesis is to use the simultaneous power and power generation plants to reach the optimal economic destination for Genco And to maximize economic profit And to minimize...
متن کاملProject scheduling optimization for contractor’s Net present value maximization using meta-heuristic algorithms: A case study
Today's competitive conditions have caused the projects to be carried out in the least possible time with limited resources. Therefore, managing and scheduling a project is a necessity for the project. The timing of a project is to specify a sequence of times for a series of related activities. According to their priority and their latency, so that between the time the project is completed and ...
متن کاملOptimizing Cost Function in Imperialist Competitive Algorithm for Path Coverage Problem in Software Testing
Search-based optimization methods have been used for software engineering activities such as software testing. In the field of software testing, search-based test data generation refers to application of meta-heuristic optimization methods to generate test data that cover the code space of a program. Automatic test data generation that can cover all the paths of software is known as a major cha...
متن کاملResource Constrained Project Scheduling with Material Ordering: Two Hybridized Meta-Heuristic Approaches (TECHNICAL NOTE)
Resource constrained project scheduling problem (RCPSP) is mainly investigated with the objective of either minimizing project makespan or maximizing project net present value. However, when material planning plays a key role in a project, the existing models cannot help determining material ordering plans to minimize material costs. In this paper, the RCPSP incorporated with the material order...
متن کامل